Forcing Posets with Large Dimension to Contain Large Standard Examples

نویسندگان

  • Csaba Biró
  • Peter Hamburger
  • Attila Pór
  • William T. Trotter
چکیده

The dimension of a poset P , denoted dim(P ), is the least positive integer d for which P is the intersection of d linear extensions of P . The maximum dimension of a poset P with |P | ≤ 2n+ 1 is n, provided n ≥ 2, and this inequality is tight when P contains the standard example Sn. However, there are posets with large dimension that do not contain the standard example S2. Moreover, for each fixed d ≥ 2, if P is a poset with |P | ≤ 2n+1 and P does not contain the standard example Sd, then dim(P ) = o(n). Also, for large n, there is a poset P with |P | = 2n and dim(P ) ≥ (1 − o(1))n such that the largest d so that P contains the standard example Sd is o(n). In this paper, we will show that for every integer c ≥ 1, there is an integer f(c) = O(c2) so that for large enough n, if P is a poset with |P | ≤ 2n+ 1 and dim(P ) ≥ n− c, then P contains a standard example Sd with d ≥ n − f(c). From below, we show that f(c) = Ω(c4/3). On the other hand, we also prove an analogous result for fractional dimension, and in this setting f(c) is linear in c. Here the result is best possible up to the value of the multiplicative constant.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irreducible Posets with Large Height Exist

The dimension of a poset (X, P) is the minimum number of linear extensions of P whose intersection is P. A poset is irreducible if the removal of any point lowers the dimension. If A is an antichain in X and X A # B’, then dim X < 2 width (X A) + 1. We construct examples to show that this inequality is best possible; these examples prove the existence of irreducible posets of arbitrarily large ...

متن کامل

The dimension of posets with planar cover graphs excluding two long incomparable chains

It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must have large height. In fact, all known constructions of such posets have two large disjoint chains with all points in one chain incomparable with all points in the other. Gutowski and Krawczyk conjectured that this feat...

متن کامل

The Proper Forcing Axiom: a tutorial

In these notes we will present an exposition of the Proper Forcing Axiom (PFA). We will first discuss examples of the consequences of PFA. We will then present two proper partial orders which are used to force two combinatorial principles which follow from PFA: The P-Ideal Dichotomy (PID) and Todorcevic’s formulation of the Open Coloring Axiom. On one hand, these posets and the proofs of their ...

متن کامل

Local Dimension is Unbounded for Planar Posets

In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets in Kelly’s example have bounded Boolean dimension and bounded local dimension, leading naturally to the questions as to whether either Boolean dimension or local dimension is bounded for the class of planar posets. The question for Boolean dimension was first posed by Nešetřil and Pudlák in 1989 a...

متن کامل

Incidence Posets and Cover Graphs

We prove two theorems concerning incidence posets of graphs, cover graphs of posets and a related graph parameter. First, answering a question of Haxell, we show that the chromatic number of a graph is not bounded in terms of the dimension of its incidence poset, provided the dimension is at least four. Second, answering a question of Kříž and Nešetřil, we show that there are graphs with large ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2016